Bayesian Quantized Network Coding via Belief Propagation
نویسندگان
چکیده
In this paper, we propose an alternative for routing based packet forwarding, which uses network coding to increase transmission efficiency, in terms of both compression and error resilience. This non-adaptive encoding is called quantized network coding, which involves random linear mapping in the real field, followed by quantization to cope with the finite capacity of the links. At the gateway node, which collects received quantized network coder packets, minimum mean squared error decoding is performed, by using belief propagation in the factor graph representation. Our simulation results show a significant improvement, in terms of the number of required packets to recover the messages, which can be interpreted as an embedded distributed source coding for correlated messages.
منابع مشابه
Loopy belief propagation for approximate inference : an empiricalstudyKevin
Recently, a number of researchers have demonstrated excellent performance by using \loopy belief propagation" | using Pearl's polytree algorithm in a Bayesian network with loops. The most dramatic instance is the near Shannon-limit performance of \Turbo Codes" | error-correcting codes whose decoding algorithm is equivalent to loopy belief propagation. In this paper we ask: is there something sp...
متن کاملFrequency-eecient Coding with Low-density Generator Matrices
In a recent paper, it is shown that if Pearl's belief propagation algorithm is applied to the Bayesian belief network of a turbo code, the turbo decoding algorithm immediately results. From this perspective, it is recognized that the turbo coding structure imposes unnecessary diierentiation on the parity checks and the turbo decoding algorithm speciies a seemingly arbitrary sequential activatio...
متن کاملAgent Belief: Presentation, Propagation, and Optimization
The aim of the article is to show a stochastic approach for both modelling and optimizing the statistical agent belief in a probability model. Two networks are defined: a decision network D of the agent belief state and a utility network U, presenting the utility structure of the agent belief problem. The agent belief is presented via the following three items (B,D,U), where B is a Bayesian net...
متن کاملIntroducing Belief Propagation in Estimation of Distribution Algorithms: A Parallel Framework
This paper incorporates Belief Propagation into an instance of Estimation of Distribution Algorithms called Estimation of Bayesian Networks Algorithm. Estimation of Bayesian Networks Algorithm learns a Bayesian network at each step. The objective of the proposed variation is to increase the search capabilities by extracting information of the, computationally costly to learn, Bayesian network. ...
متن کاملOne-Step Quantized Network Coding for Near Sparse Gaussian Messages
In this paper, mathematical bases for non-adaptive joint source network coding of correlated messages in a Bayesian scenario are studied. Specifically, we introduce one-step Quantized Network Coding (QNC), which is a hybrid combination of network coding and packet forwarding for transmission. Motivated by the work on Bayesian compressed sensing, we derive theoretical guarantees on robust recove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1209.1679 شماره
صفحات -
تاریخ انتشار 2012